Channel estimator

ABSTRACT

The present invention is a channel estimator based on the values of received data and on a priori probabilities only of received symbols. The channel estimator includes a symbol probability generator, a noise variance estimator and a channel tap estimator. The symbol probability generator generates a priori probabilities only of transmitted symbols found in the received signal(s). The noise variance estimator estimates at least one noise variance corrupting the received signal(s). The channel tap estimator generates channel estimates from the received signal(s), the a priori probabilities and the noise variance(s).

CROSS-REFERENCE

This application is a Continuation Application of U.S. patent application Ser. No. 09/438,475, filed on Nov. 12, 1999 now U.S. Pat. No. 6,603,823.

FIELD OF THE INVENTION

The present invention relates to channel estimators in wireless communication systems generally and to such channel estimators that operate on data and pilot signals in particular.

BACKGROUND OF THE INVENTION

In practical digital communication systems, the frequency response of the underlying channel from the transmitter to the receiver is seldom known at the receiver side. For example, in digital communication over the dial-up telephone network, the communication channel will be different every time a number is dialed, because the channel route will be different. In this example, the characteristics of the channel are unknown a priori. There are other types of channels, e.g. wireless channel such as radio channels and underwater acoustic channels, whose frequency response characteristics are time varying. Thus coherent communications for such channels require the utilization of adaptive algorithms, known as “channel estimators”, for tracking/estimating the varying characteristics of the channel.

Traditionally, channel estimators are divided into two categories: data aided and non-data aided (blind) estimators. Data aided channel estimators operate on a pre-specified set of transmitted symbols that are known to the receiver. These symbols do not convey any information and are often called “pilot symbols” or “training sequences”. Data aided channel estimators are typically simple to implement and relatively robust. Their major disadvantage is that they lead to an overall reduction in system throughput, since some of the transmitted symbols (the pilot symbols) do not carry any information.

Non data aided channel estimators, on the other hand, do not reduce the system throughput. However, they are typically quite complicated to implement as they are often based on higher order moments/cumulants of the received signal, and they most often suffer from high statistical variability, i.e. they suffer from large estimation errors.

The article “Maximum A Posteriori Multipath Fading Channel Estimation for CDMA Systems” by Mohamed Siala and Daniel Duponteil, Proceedings of Vehicular Technology Conference, Houston, Tex., May, 1999, describes a channel estimation algorithm which combines both approaches. This algorithm uses both pilot and data symbols to construct a channel estimator. However, this algorithm requires that the joint statistical probability distribution of the channel multipaths be known to the receiver. In practice, a complete statistical description of the channel characteristics is seldom known to the receiver. Moreover, these characteristics may be time varying.

SUMMARY OF THE INVENTION

An object of the present invention is to provide an improved channel estimator without using any a priori statistical information about the channel. Instead, the present invention uses a priori probabilities of the received symbols, be they pilot, data, power control, etc. symbols.

There is therefore provided, in accordance with a preferred embodiment of the present invention, a channel estimator based on the values of received data and on a priori probabilities only of received symbols. The channel estimator includes a symbol probability generator, a noise variance estimator and a channel tap estimator. The symbol probability generator generates a priori probabilities only of transmitted symbols found in the received signal(s). The noise variance estimator estimates at least one noise variance corrupting the received signal(s). The channel tap estimator generates channel estimates from the received signal(s), the a priori probabilities and the noise variance(s).

Additionally, in accordance with a preferred embodiment of the present invention, the channel tap estimator solves the following equation:

${\hat{h}}_{ML} = {\frac{1}{2T} \cdot {\sum\limits_{t = 1}^{T}\;{{\overset{\_}{y}(t)} \cdot {z\left( {t;{\hat{h}}_{ML}} \right)}^{*}}}}$

Moreover, in accordance with a preferred embodiment of the present invention, the channel tap estimator includes a z-unit, a combiner and a channel tap unit. The z-unit generates a z-value for z(t;ĥ_(ML)) from the a priori probabilities, the noise variance(s) and the channel estimates. The combiner combines the z-value with the received signal(s). The channel tap unit determines channel tap values from the output of the combiner.

Further, in accordance with a preferred embodiment of the present invention, the z-unit calculates the following equation for a quadrature phase shift keying (QPSK) channel:

${z\left( {t;\overset{\_}{h}} \right)} \equiv {\left\lbrack {{{p_{1}(t)}\left( {1 + j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 - j})}}}\}}}} + {{p_{2}(t)}\left( {1 - j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 + j})}}}\}}}} + {{p_{3}(t)}\left( {{- 1} + j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({{- 1} - j})}}}\}}}} + {{p_{4}(t)}\left( {{- 1} - j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({{- 1} + j})}}}\}}}}} \right\rbrack \times \left\lbrack {{p_{1}(t){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 - j})}}}\}}}} + {{p_{2}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 + j})}}}\}}}} + {{p_{3}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({{- 1} - j})}}}\}}}} + {{p_{4}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({{- 1} + j})}}}\}}}}} \right\rbrack^{- 1}}$ where y(t) is a vector of the received signal(s), h is a vector of the channel tap estimates and p(t) is a vector of the symbol probabilities.

Still further, in accordance with a preferred embodiment of the present invention, the channel tap unit is a summer over a window of received symbols.

Additionally, in accordance with a preferred embodiment of the present invention, when s(t) is a pilot symbol, then p(t)=ē_(i) where the ē_(i)'s are the normal basis vectors having a one (1) in their i-th component and zero otherwise. When s(t) is a data symbol, then p ₁(t)=p ₂(t)=p ₃(t)=p ₄(t)=0.25

When s(t) is a transmit power control (IPC) symbols, then p ₁(t)=p ₄(t)=0.5, p ₂(t)=p ₃(t)=0

Moreover, in accordance with a preferred embodiment of the present invention, the channel tap unit includes an anchor unit, an averager and an interpolator. The anchor unit determines a pilot anchor ĥ_(p) using N_(p) pilot symbols of one time slot n and a data anchor ĥ_(s) using N_(s) data symbols of the time slot n. The averager averages the pilot and data anchors to produce a slot anchor ĥ_(anchor)(n) and the interpolator interpolates between adjacent anchors ĥ_(anchor)(n−1) and ĥ_(anchor)(n) to obtain channel estimates for the n-th slot.

Further, in accordance with a preferred embodiment of the present invention, N_(s)=2N_(p) and N_(p) of the data symbols can be taken from before the pilot symbols of the time slot and N_(p) of the data symbols can be taken from after the pilot symbols.

Still further, in accordance with a preferred embodiment of the present invention, the unit for linearly interpolates includes unit for separately interpolates amplitudes and phases of the adjacent anchors.

Additionally, in accordance with a preferred embodiment of the present invention, the channel estimator also includes a unit that averages slot anchors as follows:

${{\hat{H}}_{anchor}\left( {n - 1} \right)} = \frac{\sum\limits_{k = {- M}}^{M}\;{{{\hat{h}}_{anchor}\left( {n - 1 - k} \right)} \cdot \beta_{k}}}{\sum\limits_{k = {- M}}^{M}\beta_{k}}$ where Ĥ_(anchor) is the average value of slot anchors ĥ_(anchor) in a slot ranging between the values −M to M for k, and β_(k) is a user defined weight factor.

Moreover, in accordance with a preferred embodiment of the present invention, the z-unit includes a lookup table unit.

Further, in accordance with a preferred embodiment of the present invention, the at least one received signal is the output of at least one despreader. Alternatively, it could be the downconverted and demodulated output of more than one antenna

Still further, in accordance with a preferred embodiment of the present invention, the noise variance estimator generates a noise variance {circumflex over (σ)} ² as follows: {circumflex over (σ)}_(k) ²(n)=(1−α)·{circumflex over (σ)}_(k) ²(n−1)+α·{tilde over (σ)}_(k) ²(n) where the time index n is in units of slot, α is a user selectable exponential forgetting factor, and

$\left. {{{\overset{\sim}{\sigma}}_{k}^{2}(n)} \equiv {\frac{1}{N_{P}}\sum\limits_{t = 1}^{N_{P}}}}\; \middle| {\frac{{\overset{\_}{y}}_{k}(t)}{G(t)} \cdot {s(t)}^{*}} \middle| {}_{2}{- \left| {\frac{1}{N_{P}}{\sum\limits_{t = 1}^{N_{P}}{\frac{{\overset{\_}{y}}_{k}(t)}{G(t)} \cdot {s(t)}^{*}}}} \right|^{2}} \right.$ where N_(p) is the number of pilot symbols per slot, G(t) is an automatic gain control (AGC) level and y _(k)(t) is the k-th element of the vector y(t).

Further, in accordance with a preferred embodiment of the present invention, the channel tap unit is an infinite impulse response (IIR) filter given by:

${{\hat{h}(t)} = {{{- {\hat{h}\left( {t - 1} \right)}}a_{1}} -}},\ldots\mspace{11mu},{{{- {\hat{h}\left( {t - p} \right)}}a_{p}} + {{{\overset{\_}{y}(t)} \cdot {z\left( {t;{\hat{h}\left( {t - 1} \right)}} \right)}^{*}}b_{0}} + {{{\overset{\_}{y}\left( {t - 1} \right)} \cdot {z\left( {{t - 1};{\hat{h}\left( {t - 2} \right)}} \right)}^{*}}b_{1}} +},\ldots\mspace{11mu},{{{\overset{\_}{y}\left( {t - q} \right)} \cdot {z\left( {{t - q};{\hat{h}\left( {t - q - 1} \right)}} \right)}^{*}}b_{q}}$ where a_(i) and b_(i) are user-defined parameters as are the filter orders p and q.

Alternatively, there is also provided a channel estimator having two estimators, a first estimator that operates on a continuous pilot channel and a second estimator that operates on a traffic channel with interleaved pilot symbols. The estimator also includes a combiner that combines the output of the first and second estimators. The first estimator is similar to those of the prior art while the second estimator is similar to that described hereinabove.

Finally, the present invention includes the methods performed by the channel estimators disclosed herein.

BRIEF DESCRIPTION OF THE DRAWINGS AND APPENDIX

The present invention will be understood and appreciated more fully from the following detailed description taken in conjunction with the appended drawings and Appendix in which:

FIGS. 1A, 1B and 1C are scatter plot illustrations of the values of a function, in the presence of varying levels of noise, where the signal to noise ratio (SNR) is high, medium and low, respectively;

FIG. 2 is a schematic illustration of a batch mode channel estimator, constructed and operative in accordance with a preferred embodiment of the present invention;

FIGS. 3A and 3B are schematic illustrations of implementations of the channel estimator of FIG. 2, for single and multiple CDMA fingers, respectively;

FIG. 4 is a schematic illustration of an adaptive channel estimator, constructed and operative in accordance with a preferred embodiment of the present invention;

FIG. 5 is a schematic illustration of two anchors, useful in understanding an anchor embodiment of the channel estimator of FIG. 4;

FIG. 6 is a schematic illustration of an implementation of the channel estimator of FIG. 4, for a single finger; and

Appendix A provides a series of approximations to a main component of the channel estimator to simplify its implementation.

DETAILED DESCRIPTION OF THE PRESENT INVENTION

The present invention is a channel estimator for linearly modulated, digital communication schemes. It takes as input the downconverted and demodulated received signal, denoted by a vector y(t). For example, y(t) can be the output of despreaders in a code division, multiple access (CDMA) rake receiver (as known in the art) or the demodulator output in a PAM/QAM (pulse amplitude modulation/quadrature amplitude modulation) receiver (as also known in the art).

The present text will emphasize CDMA cellular systems; however, the present invention can be applied to any digital, linear modulation scheme.

It will be appreciated that, in a receiver having more than one antenna, different elements of the vector y(t) will correspond to the downconverted and demodulated signals from the different antennas. In a multiple antenna, CDMA receiver, there are multiple despreaders per antenna. The elements of the vector y(t) correspond to the output of all of the despreaders.

Various embodiments of channel estimator 22 are shown in FIGS. 2, 3A, 3B, 4, 5 and 6. To understand the structure of the channel estimator of the present invention, a derivation is first provided.

Derivation

The vector output y(t) at time instant t is modeled by a simplified static channel model as a function of the transmitted signal s(t), a vector of static channel taps h, and a vector n(t) of noise samples. The model is: y (t)= h·s(t)+ n (t)  Equation 1

It will be appreciated that: dim{ y (t)}=dim{ h}=dim{ n (t)}≧dim{s(t)}=1 where dim{ v} stands for the dimension of the vector V. Thus, the number of unknown channel taps is denoted by dim{ h} which is at least 1. For example, in a CDMA rake receiver, dim{ h} equals the number of active fingers. The noise term n(t) for a CDMA system represents the additive white Gaussian noise (AWGN), the cross-talks from other users, cross-talks from un-modeled channel taps (i.e. channel taps that do not correspond to any of the active fingers), etc. and the channel estimate h is the unknown finite dimensional parameter vector that needs to be estimated based on observation of y(t) for t=1,2, . . . , T.

In accordance with a preferred embodiment of the present invention, the following assumptions are made in order to generate the channel estimator:

-   -   1. s(t) is a sequence of independent and identically distributed         (i.i.d.) random variables of data symbols with time varying, a         priori symbol probabilities p(t). For simplicity, s(t) will be         considered herein as a quadrature phase shift keying (QPSK)         signal.     -   2. n(t) is an i.i.d. sequence of complex valued, zero mean         Gaussian random vectors with independent components whose         variance is σ². Conventional circular Gaussian probability         distribution functions (pdf's) are assumed, i.e. the real and         imaginary parts of each of the noise components are independent         with variance σ²/2. The case of unequal noise variances (that         is, when each component of n(t) possesses different variance) is         also considered hereinbelow.     -   3. s(t) and n(t) are mutually independent.

The present invention defines a probability vector p(t) that defines the a priori probabilities for the various symbols of s(t). In CDMA systems, signals are sent between a mobile and a base station in pre-defined time slots. In each time slot, many symbols are sent, only some of which are raw data symbols, e.g. the compressed voice data. The remaining symbols are used for controlling the communication, estimating the unknown channel taps, etc. Among these control symbols there are the pilot symbols, which, as described hereinabove, are a set of symbols that are a-priori known to the receiver. The pilot symbols are used to synchronize the base and mobile stations and for estimating the channel taps. Other control symbols include transmit power control (TPC) symbols. With the current standardization regarding 3^(rd) generation cellular systems (3GPP RAN wideband CDMA), these TPC symbols are known a-priori to have only one out of 2 possible values. The TPC symbols are defined in the 3GPP document, RAN 25.214 V1.1.1(1999-09). The probability vector p(t) allows the present invention to treat both pilot and data symbols.

For a QPSK symbol constellation, p(t) is defined as follows:

$\begin{matrix} {{\overset{\_}{p}(t)} = {\begin{bmatrix} {{\Pr\left\{ {{s(t)} = {1 + j}} \right\}}\mspace{20mu}} \\ {{\Pr\left\{ {{s(t)} = {1 - j}} \right\}}\mspace{20mu}} \\ {\Pr\left\{ {{s(t)} = {{- 1} + j}} \right\}} \\ {\Pr\left\{ {{s(t)} = {{- 1} - j}} \right\}} \end{bmatrix} \equiv \begin{bmatrix} {p_{1}(t)} \\ {p_{2}(t)} \\ {p_{3}(t)} \\ {p_{4}(t)} \end{bmatrix}}} & {{Equation}\mspace{20mu} 2} \end{matrix}$

If s(t) is a pilot symbol, then there exist some i, 1≦i≦4 such that p (t)=ē _(i)  Equation 3

-   -   where the ē_(i)'s are the normal basis vectors having a one (1)         in their i-th component and zero otherwise. The specific vector         ē_(i) used per time instant depends on the transmitted pilot         symbol. For example, the following sequence of pilot symbols         s(1)=1+j,s(2)=1−j,s(3)=1+j,s(4)=−1−j  Equation 4     -   corresponds (from Equation 2) to the following sequence of         ē_(i)'s         p (1)=ē₁ , p (2)=ē ₂ , p (3)=ē ₁ , p (4)=ē₄  Equation 5     -   If, on the other hand, s(t) is an equally likely data symbol,         then         p ₁(t)=p ₂(t)=p ₃(t)=p ₄(t)=0.25  Equation 6

Furthermore, if there is some a-priori information on the transmitted data, it can be incorporated herein. For example, the transmit power control (IPC) symbols are known a-priori to have only one out of 2 possible values either 1+j or −1−j. For TPC symbols, the corresponding p(t) would be

$\begin{matrix} {{\overset{\_}{p}(t)} = \begin{bmatrix} 0.5 \\ 0 \\ 0 \\ 0.5 \end{bmatrix}} & {{Equation}\mspace{14mu} 7} \end{matrix}$

Now, with the above assumptions, the conditional pdf of y(t) given s(t) and h is Gaussian and it is given by,

$\quad\begin{matrix} \begin{matrix} {{P\left( {{{\overset{\_}{y}(t)}/{s(t)}};\overset{\_}{h}} \right)} = {{c \cdot {\mathbb{e}}}\frac{\left. ||{{\overset{\_}{y}(t)} - {\overset{\_}{h} \cdot {s(t)}}} \right.||^{2}}{\sigma^{2}}}} \\ {= {{c \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}}}{\sum\limits_{k = 1}^{{Dim}{\{ y\}}}\;{{{y_{k}(t)} - {h_{k} \cdot {s(t)}}}}^{2}}}} \end{matrix} & {{Equation}\mspace{14mu} 8} \end{matrix}$

Therefore,

$\begin{matrix} {{{P\left( {{\overset{\_}{y}(t)};\overset{\_}{h}} \right)} = {c\left\lbrack {{{p_{1}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{ y\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({1 + j})}}}}^{2}}}} + {{p_{2}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{ y\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({1 - j})}}}}^{2}}}} + {{p_{3}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{ y\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({{- 1} + j})}}}}^{2}}}} + {{p_{4}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{ y\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({{- 1} - j})}}}}^{2}}}}} \right\rbrack}}\mspace{160mu}} & {{Equation}\mspace{14mu} 9} \end{matrix}$

Due to the i.i.d nature of both s(t) and n(t), the joint pdf of y(t) for t=1, 2, . . . , T is simply the product of the one dimensional pdf's, or in the log domain:

$\begin{matrix} {{{{Log}\left\lbrack {P\left( {\overset{\_}{Y};\overset{\_}{h}} \right)} \right\rbrack} = {{\sum\limits_{t = 1}^{T}\;{{Log}\left\lbrack {{{p_{1}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({1 + j})}}}}^{2}}}} + \mspace{40mu}{{p_{2}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({1 - j})}}}}^{2}}}} + \mspace{140mu}{{p_{3}(t)} \cdot \;{\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({{- 1} + j})}}}}^{2}}}} + {{p_{4}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({{- 1} - j})}}}}^{2}}}}} \right\rbrack}}\mspace{11mu} + {T \cdot {{Log}\lbrack c\rbrack}}}}\mspace{160mu}} & {{Equation}\mspace{14mu} 10} \end{matrix}$

-   -   where, for notational brevity, Y denotes the vector whose t-th         sub-block is y(t) for t=1,2, . . . , T (i.e. Y is a (Dim{         y}·T)×1 column vector).

Now, maximum likelihood (ML) estimation of h amounts to differentiating Equation 10 with respect to h and equating to zero. To simplify the notation, we define φ(t) as follows.

$\begin{matrix} {{\overset{\_}{\phi}(t)} = {\left( {\frac{\partial}{{\partial{Real}}\left\{ \overset{\_}{h} \right\}} + {j \cdot \frac{\partial}{{\partial{Imag}}\left\{ \overset{\_}{h} \right\}}}} \right){{Log}\left\lbrack {P\left( {{\overset{\_}{y}(t)};\overset{\_}{h}} \right)} \right\rbrack}}} & {{Equation}\mspace{14mu} 11} \end{matrix}$

The ML channel estimator is obtained by solving the implicit equation:

$\begin{matrix} {{\sum\limits_{t = 1}^{T}\;{\overset{\_}{\phi}(t)}} = \overset{\_}{0}} & {{Equation}\mspace{14mu} 12} \end{matrix}$

Using the equality below,

$\begin{matrix} {{{{p_{1}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({1 + j})}}}}^{2}}}} + {{p_{2}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({1 - j})}}}}^{2}}}} + {{p_{3}(t)} \cdot \;{\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({{- 1} + j})}}}}^{2}}}} + {{p_{4}(t)} \cdot {\mathbb{e}}^{\frac{1}{\sigma^{2}}{\sum\limits_{k = 1}^{{Dim}{\{\overset{\_}{y}\}}}\;{{{y_{k}{(t)}} - {h_{k} \cdot {({{- 1} - j})}}}}^{2}}}}} = {{\mathbb{e}}^{\frac{1}{\sigma^{2}}{({{{\overset{\_}{y}{(t)}}}^{2} + {2{\overset{\_}{h}}^{2}}})}} \cdot \left\lbrack {{{p_{1}(t)} \cdot {\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {\cdot {({1 - j})}}}}\}}}} + {{p_{2}(t)} \cdot {\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {\cdot {({1 + j})}}}}\}}}} + {{p_{3}(t)} \cdot {\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {\cdot {({{- 1} - j})}}}}\}}}} + {{p_{4}(t)} \cdot {\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {\cdot {({{- 1} + j})}}}}\}}}}} \right\rbrack}} & {{Equation}\mspace{14mu} 13} \end{matrix}$

-   -   we obtain, after quite a few algebraic manipulations:

$\begin{matrix} {{\overset{\_}{\phi}(t)} = {{{- \frac{4}{\sigma^{2}}} \cdot \overset{\_}{h}} + {\frac{2}{\sigma^{2}} \cdot {\overset{\_}{y}(t)} \cdot {z\left( {t;\overset{\_}{h}} \right)}^{*}}}} & {{Equation}\mspace{14mu} 14} \end{matrix}$

-   -   where (•)* stands for the conjugate of the bracketed expression         and the scalar process z(t; h) is given by:

$\begin{matrix} {{z\left( {t;\overset{\_}{h}} \right)} \equiv \left\lbrack {{{p_{1}(t)}\left( {1 + j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 - j})}}}\}}}} + {{p_{2}(t)}\left( {1 - j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} >}}}}} + {{p_{3}(t)}\left( {{- 1} + j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({{- 1} - j})}}}\}}}} + {{p_{4}(t)}\left( {{- 1} - j} \right){\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},}}} \times \left\lbrack {{{p_{1}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 - j})}}}\}}}} + {{p_{2}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {\overset{\_}{y}{(t)}}},{{\overset{\_}{h}}^{*} > {({1 + j})}}}\}}}} + {{p_{3}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {y{(t)}}},{h^{*} > {({{- 1} - j})}}}\}}}} + {{p_{4}(t)}{\mathbb{e}}^{\frac{2}{\sigma^{2}}{Real}{\{{{< {y{(t)}}},{h^{*} > {({{- 1} - j})}}}\}}}}} \right\rbrack^{- 1}}} \right.} & {{Equation}\mspace{14mu} 15} \end{matrix}$

-   -   < x, y> denotes the scalar product between the vectors x and y.         Combining Equation 12 and Equation 14, the ML estimatorĥ_(ML)         becomes the solution of the implicit equation:

$\begin{matrix} {{\hat{h}}_{ML} = {\frac{1}{2T} \cdot {\sum\limits_{t = 1}^{T}\;{{\overset{\_}{y}(t)} \cdot {z\left( {t;{\hat{h}}_{ML}} \right)}^{*}}}}} & {{Equation}\mspace{14mu} 16} \end{matrix}$

It will be appreciated that, in the general setting, no closed form solution exists to Equation 16. However, there are some special cases of the ML estimator of Equation 16. First, consider the case of pilot symbols, by substituting Equation 3 into Equation 15: This results in: z(t; h )=s(t)  Equation 17

-   -   and Equation 16 reduces to:

$\begin{matrix} {{\hat{h}}_{ML} = {\frac{1}{2T} \cdot {\sum\limits_{t = 1}^{T}\;{{\overset{\_}{y}(t)} \cdot {s(t)}^{*}}}}} & {{Equation}\mspace{14mu} 18} \end{matrix}$

-   -   which is the conventional data-aided ML channel estimator.     -   In the non-data-aided setting where Equation 6 holds, Equation         15 reduces to:

$\begin{matrix} {{z\left( {t;\overset{\_}{h}} \right)} = {\left\lbrack {{{\left( {1 + j} \right) \cdot \sinh}\;\left( {\frac{2}{\sigma^{2}}{Real}\left\{ {{< {\overset{\_}{y}(t)}},{{\overset{\_}{h}}^{*} > \left( {1 - j} \right)}} \right\}} \right)} + {{\left( {1 - j} \right) \cdot \sinh}\;\left( {\frac{2}{\sigma^{2}}{Real}\left\{ {{< {\overset{\_}{y}(t)}},{{\overset{\_}{h}}^{*} > \left( {1 + j} \right)}} \right\}} \right)}} \right\rbrack \times \mspace{194mu}\left\lbrack {{\cosh\;\left( {\frac{2}{\sigma^{2}}{Real}\left\{ {{< {\overset{\_}{y}(t)}},{{\overset{\_}{h}}^{*} > \left( {1 - j} \right)}} \right\}} \right)} + {\cosh\;\left( {\frac{2}{\sigma^{2}}{Real}\left\{ {{< {\overset{\_}{y}(t)}},{{\overset{\_}{h}}^{*} > \left( {1 + j} \right)}} \right\}} \right)}} \right\rbrack^{- 1}}} & {{Equation}\mspace{14mu} 19} \end{matrix}$

In a high SNR setting, it can be shown that, in both nominator and denominator of z(t; h), only one of the exponents is dominant and hence, z(t; h )≈ŝ(t)  Equation 20

-   -   where ŝ(t) is the nearest neighbor to < y(t), h*> from the         source alphabet (i.e. ŝ(t) is the hard decision of < y(t), h*>).         In this case, the ML estimator reduces to:

$\begin{matrix} {{\hat{h}}_{ML} = {\frac{1}{2T} \cdot {\sum\limits_{t = 1}^{T}\;{{\overset{\_}{y}(t)} \cdot {\hat{s}(t)}^{*}}}}} & {{Equation}\mspace{14mu} 21} \end{matrix}$

-   -   which is the well known, decision directed, channel estimator.

In a low SNR setting, the ML estimator of the present invention, in effect, uses a soft symbol metric that is based on the instantaneous SNR and follows a hyperbolic law. To illustrate this, reference is now made to FIGS. 1A, 1B and 1C which graph the function in Equation 19 for several SNR values (20 dB, 10 dB and 0 dB, respectively) and for the scalar case of one active finger. Each figure shows a scatter plot of the values of z(t; h) in the complex plane.

As can be seen, at the high SNR of FIG. 1A, z(t; h) always takes on one of the four hard decision values (1−j), (1+j), (−1−j), (−1+j) of the received signal. This matches with Equation 20 and 21. However, at lower SNR's, z(t; h) is “softened” according to the confidence of each specific hard decision. Thus, FIG. 1B (medium SNR) has values for z(t; h) mostly along the real and imaginary axes and FIG. 1C (low SNR) has values for z(t; h) all over the complex plane.

Until now, the noise variance has been identical for all elements of the noise vector n(t). It is also possible to relax this assumption. Thus, in Equation 15 and 19, the following

$\begin{matrix} {\frac{2}{\sigma^{2}}{Real}\left\{ {{< {\overset{\_}{y}(t)}},{{\overset{\_}{h}}^{*} > \ldots}} \right\}} & {{Equation}\mspace{14mu} 22} \end{matrix}$

-   -   is replaced by         2 Real{<{tilde over (y)}(t), h*> . . . }  Equation 23     -   where {tilde over (y)}(t) is obtained from y(t) by dividing each         of its components by the corresponding noise variance, i.e.

$\begin{matrix} {\left\{ {\overset{\sim}{y}(t)} \right\}_{i} \equiv \frac{\left\{ {\overset{\_}{y}(t)} \right\}_{i}}{\sigma_{i}^{2}}} & {{Equation}\mspace{14mu} 24} \end{matrix}$

-   -   Appendix A provides a series of approximations to Equation 19 to         simplify its implementation.

In some applications, such as the 3GPP wideband CDMA cellular systems, there is a continuous pilot channel separate from a traffic channel that contains data and pilot symbols. For these applications, a channel estimator based on both the traffic and the pilot channels can be constructed. The channel estimator of the present invention can be used for the traffic channel while a prior art channel estimator can be used for the continuous pilot channel. The two channel estimates can be combined to produce the final channel estimate. This provides a statistically more stable channel estimator.

Implementation

Reference is now made to FIG. 2, which schematically illustrates a channel estimator 30 of the present invention. Estimator 30 comprises a noise variance estimator 32, an a priori symbol probability generator 34 and a channel tap determiner 36.

Noise variance estimator 32 determines the noise variance σ² as described hereinbelow. There are a variety of methods, known in the art, for estimating the noise variance σ². One method, incorporated herein by reference, is described in the article “An Efficient Algorithm for Estimating the Signal-to-Interference Ratio in TDMA Cellular Systems”, by Mustafa Turkboylari et al., IEEE Transactions on Communications Vol. 46, No. 6, June 1998, pp. 728-731.

Another method of estimating the noise variance, suitable for the 3GPP wideband CDMA time slot structure, uses pilot symbols, only and implements the following equations for the k-th element of the noise variance vector {circumflex over (σ)} ²: {circumflex over (σ)}_(k) ²(n)=(1−α)·{circumflex over (σ)}_(k) ²(n−1)+α·{tilde over (σ)}_(k) ²(n)  Equation 25

Where the time index n is in units of slot, α is a user selectable exponential forgetting factor, and

$\left. {{{\overset{\sim}{\sigma}}_{k}^{2}(n)} \equiv {\frac{1}{N_{P}}\sum\limits_{t = 1}^{N_{P}}}}\; \middle| {\frac{{\overset{\_}{y}}_{k}(t)}{G(t)} \cdot {s(t)}^{*}} \middle| {}_{2}{- \left| {\frac{1}{N_{P}}{\sum\limits_{t = 1}^{N_{P}}{\frac{{\overset{\_}{y}}_{k}(t)}{G(t)} \cdot {s(t)}^{*}}}} \right|^{2}} \right.$

-   -   where N_(p) is the number of pilot symbols per slot, G(t) is the         receiver's automatic gain control (AGC) level (as known in the         art) and y _(k)(t) is the k-th element of the vector y(t).

Symbol probability generator 34 receives information from higher layers in the receiver defining the type of the current symbol. For example, the higher layer may indicate that the current symbol is a pilot, a power control or a data symbol. Symbol probability generator 34 then produces the probability vector p(t) associated with the symbol type, as per Equations 2-7.

Channel tap determiner 36 determines the channel tap estimate vector by solving Equation 16. Since Equation 16 is an implicit equation, one has to resort to iterative algorithms for solving it. There are numerous iterative approaches, based on gradients and/or Hessians of Equation 16 that can be implemented. See, for example, the book Numerical Recipes in C: The Art of Scientific Computing by Press et al., 2^(nd) Edition, Cambridge University Press, 1992.

Channel estimator 30 operates in a “batch” mode, taking a sequence of T samples (where T is a user selectable parameter often related to the fading rate) and iterating until the channel estimate h is stable.

As with any iterative algorithm, an initial point must be provided for the algorithm. There are a variety of initialization procedures. For example, one may arbitrarily set the initial h to unity and then apply the iterative algorithm to converge to the true value. Alternatively, one can apply a conventional channel estimation technique based only on pilot symbols and use its output as the initial value for h.

Reference is now made to FIG. 3A, which schematically illustrates the implementation of a simple iterative solution to Equation 16 that does not require calculation of gradients or Hessians. The channel estimator 30 of FIG. 3A is a single tap channel estimator.

In the embodiment of FIG. 3A, channel tap determiner 36 comprises a scalar z-generator 37, a multiplier 38 and a summer 39 over a period of length T of the output of vector multiplier 38.

Z-generator 37 receives the demodulated scalar signal y(t), the probability vector p(t) from probability generator 34, the noise variance {circumflex over (σ)}² from noise variance estimator 32 and the channel estimate h′ of the previous iteration. Z-generator 37 then generates the scalar value z(t;h′) from Equation 15. For example, this operation can utilize a lookup table. In particular, when Equation 19 needs to be computed, a lookup table can be used which saves the need to calculate the hyperbolic sine and cosine functions.

Multiplier 38 multiplies the output y(t) with the value z(t;h′) and summer 39 sums the output of multiplier 38 over a period of length T. The result is the updated channel estimate h which is then fed back to z-generator 37.

Reference is now made to FIG. 3B, which schematically illustrates the structure of a two-tap batch channel estimator of the present invention, here labeled 40, when operating on a vector y(t) whose dimension is two. Elements similar to those of FIG. 3A carry similar reference numerals.

Channel estimator 40 comprises noise variance estimator 32, a z-generator 42, two multipliers 38A and 38B and two summers 39A and 39B. Z-generator 42 receives the demodulated vector signal y(t), the probability vector p(t) from probability generator 34, the noise variance {circumflex over (σ)}² from noise variance estimator 32 and the channel estimates h′_(i) of the previous iteration.

Z-generator 42 then generates the value z(t;h′) from Equation 15. Multipliers 38A and 38B multiply the outputs y₀(t)and y₁(t), respectively, with the value z(t;h′) and summers 39A and 39B sum the outputs of their respective multipliers 38A and 38B over a period of length T. Each summer 39 produces its updated channel estimate h_(i), which is also fed back to z-generator 42.

It will be appreciated that the present invention is also operative for more than two taps. The structure of the channel estimator is similar to that of FIG. 3B.

The channel estimator of the present invention can also be implemented in a sequential (or adaptive) manner. For these implementations, the channel estimator updates the estimate one sample at a time. This amounts to finding a sequential solution to Equation 16 and it typically takes some time to converge. Adaptive solutions inherently assume a slowly time-varying channel so that channel variations can be tracked. Initialization for these implementations is as described hereinabove.

Reference is now made to FIG. 4, which illustrates a general adaptive channel estimator 100. Estimator 100 is similar to estimator 30 of FIG. 2 and comprises an adaptive channel tap determiner 102 in place of channel tap determiner 36.

Adaptive channel tap determiner 102 sequentially solves Equation 27 (hereinbelow) where, for each new time instance t, a new solution is obtained.

$\begin{matrix} {{\hat{h}}_{t} = {\sum\limits_{m = 1}^{t}\;{{\overset{\_}{y}(m)} \cdot {z\left( {m;{\hat{h}}_{t}} \right)}^{*} \cdot \lambda^{t - m}}}} & {{Equation}\mspace{14mu} 27} \end{matrix}$

-   -   λ is an exponential forgetting factor. With the special choice         of λ=1, Equation 27 reduces to Equation 16 up to a scalar gain.

There are a variety of sequential algorithms, two of which are presented hereinbelow.

A first approach uses anchors and linear interpolation between adjacent anchors similar to the one described in the following documents that are incorporated herein by reference:

H. Andoh, M. Sawahashi, and F. Adachi, “Channel Estimation Using Time Multiplexed Pilot Symbols for Coherent Rake Combining for DS-CDMA Mobile Radio,” Proceedings of the IEEE Vehicular Technology Conference, 1997, pp. 954-958.

F. Adachi and M. Sawahashi, “Wideband Wireless Access Based on DS-CDMA,” IEEE Transactions on Communications, pp. 1305-1316, July 1998.

F. Adachi, M. Sawahashi, and H. Suda, “Wideband DS-CDMA for Next Generation Mobile Communications Systems,” IEEE Communications Magazine, September 1998.

In the prior art anchor approach, illustrated in FIG. 5 to which reference is now briefly made, the channel estimator averages a few pilot symbols from the beginning of each of a series of successive time-slots to generate a sequence of “anchors” 50 and 52. Then, the channel estimator linearly interpolates between the anchor at the beginning of one slot to that at the beginning of the next slot to generate the channel estimates 54.

In accordance with a preferred embodiment of the present invention, the channel estimator computes a pilot anchor ĥ_(p) using the N_(p) pilot symbols of one time slot and a data anchor ĥ_(s) using N_(s) data symbols, as follows:

$\begin{matrix} {{\hat{h}}_{p} = {\frac{1}{2N_{p}} \cdot {\sum\limits_{k = 1}^{N_{p}}\;{{\overset{\_}{y}(k)} \cdot {s(k)}^{*}}}}} & {{Equation}\mspace{14mu} 28} \\ {{\hat{h}}_{s} = {\frac{1}{2N_{s}} \cdot {\sum\limits_{k = 1}^{N_{s}}\;{{y(k)} \cdot {z\left( {k;{\hat{h}}_{p}} \right)}^{*}}}}} & \text{Equation~~~29} \end{matrix}$

-   -   where N_(s) is a user-defined parameter determining the number         of data symbols to be used. One may set N_(s)=2N_(p) so that         N_(p) of the data symbols are taken from before the pilot         symbols and N_(p) of the data symbols are taken from after the         pilot symbols. The channel estimator then averages the two         values:

$\begin{matrix} {{\hat{h}}_{anchor} = \frac{{\hat{h}}_{p} + {\hat{h}}_{s}}{2}} & {{Equation}\mspace{14mu} 30} \end{matrix}$

The channel estimator linearly interpolates between adjacent anchors ĥ_(anchor)(n−1) and ĥ_(anchor)(n) to obtain the channel estimates for the n-th slot. In accordance with a preferred embodiment of the present invention, the channel estimator separately interpolates the amplitudes and phases of the adjacent anchors.

In order to improve upon the statistical variability of the anchors, the older anchor can be averaged, as follows:

$\begin{matrix} {{{\hat{H}}_{anchor}\left( {n - 1} \right)} = \frac{\sum\limits_{k = {- M}}^{M}\;{{{\hat{h}}_{anchor}\left( {n - 1 - k} \right)} \cdot \beta_{k}}}{\sum\limits_{k = {- M}}^{M}\beta_{k}}} & {{Equation}\mspace{14mu} 31} \end{matrix}$

-   -   and, as before, phase and amplitude linear interpolations         between Ĥ_(anchor)(n−1) and ĥ_(anchor)(n) generate the n-th slot         channel estimator. Both M and the β_(k)'s are user defined         parameters. For example, the values M=1, β⁻¹=β₁=0.8 and β₀=1         were used in H. Andoh, M. Sawahashi, and F. Adachi, “Channel         Estimation Using Time Multiplexed Pilot Symbols for Coherent         Rake Combining for DS-CDMA Mobile Radio,” Proceedings of the         IEEE Vehicular Technology Conference, 1997, pp. 954-958.

Reference is now made to FIG. 6, which illustrates another adaptive channel estimator, labeled 60. Channel estimator 60 is similar to channel estimator 30 of FIG. 3A except that summer 39 is replaced by an infinite impulse response (IIR) filter 62.

In this embodiment, the product y(t)·z(t; h) is filtered with some pre-specified IIR filter. Here, we have the channel estimator given by:

$\begin{matrix} {{{\hat{h}(t)} = {{{- {\hat{h}\left( {t - 1} \right)}}a_{1}} -}},\ldots\mspace{11mu},{{{- {\hat{h}\left( {t - p} \right)}}a_{p}} + {{{\overset{\_}{y}(t)} \cdot {z\left( {t;{\hat{h}\left( {t - 1} \right)}} \right)}^{*}}b_{0}} + {{{\overset{\_}{y}\left( {t - 1} \right)} \cdot {z\left( {{t - 1};{\hat{h}\left( {t - 2} \right)}} \right)}^{*}}b_{1}} +},\ldots\mspace{11mu},{{{\overset{\_}{y}\left( {t - q} \right)} \cdot {z\left( {{t - q};{\hat{h}\left( {t - q - 1} \right)}} \right)}^{*}}b_{q}}} & {{Equation}\mspace{14mu} 32} \end{matrix}$

-   -   where z(t;ĥ(t−1)) is given by Equation 17 for pilot symbols, and         by Equation 19 for data symbols (or by a similar expression for         TPC bits). The filter coefficients a_(i) and b_(i) are         user-defined parameters as are the filter orders p and q. Note         that taking p=q=1 reduces to the well known exponential         forgetting factor sequential solution of Equation 32 where the         iterations are performed sequentially in time. In general, the         specific choice of filter parameters, should represent the best         compromise between noise rejection and filter delay. In order to         maintain a low complexity implementation, the data should be         decimated prior to applying Equation 32. For example, for a         constant input rate of 16 ksps, one of 4 samples is used in         Equation 32 when the symbol rate is 64 ksps. However, the pilot         symbols should not be decimated. Thus, for a slot containing 4         pilot symbols and 36 data symbols, the estimator uses 10 samples         per slot, 4 of which correspond to pilot symbols and the other 6         correspond to data symbols. The data can also be averaged prior         to the filtration operation, rather than decimated. A further         alternative is to combine the two approaches and use averaged         symbols only at the feedback part of Equation 32 (i.e. the terms         multiplied by the a_(i)). This produces a very slowly varying,         adaptive channel estimator but does not increase the estimator's         delay. Such slowly varying estimators can be utilized to track         slowly fading channels.

The methods and apparatus disclosed herein have been described without reference to specific hardware or software. Rather, the methods and apparatus have been described in a manner sufficient to enable persons of ordinary skill in the art to readily adapt commercially available hardware and software as may be needed to reduce any of the embodiments of the present invention to practice without undue experimentation and using conventional techniques.

It will be appreciated by persons skilled in the art that the present invention is not limited by what has been particularly shown and described herein above. Rather the scope of the invention is defined by the claims that follow after the appendix: 

1. A receiver comprising: a channel estimator to generate a maximum likelihood estimate of one or more channel taps from an equation involving a) said one or more channel taps, b) a priori probabilities of transmitted symbols in one or more samples of a received signal, wherein the a priori probabilities are based on type of the transmitted symbols, and c) one or more noise samples, wherein said equation is an implicit equation for said one or more channel taps.
 2. The receiver of claim 1, wherein said channel estimator is to generate said estimate for a batch of samples at a time.
 3. The receiver of claim 1, wherein said channel estimator is to generate said estimate for a single sample at a time.
 4. The receiver of claim 1, wherein said one or more channel taps correspond to one or more active fingers of a rake receiver.
 5. The receiver of claim 1, wherein the type of the transmitted signals is data symbol type, pilot type or power control type.
 6. A channel estimator comprising: a symbol probability generator to generate a priori probabilities of transmitted symbols in a received signal; a noise variance estimator to estimate a variance of noise corrupting said received signal; and a channel tap estimator to generate a maximum likelihood estimate of one or more channel taps using the equation ${{\hat{h}}_{ML} = {\frac{1}{2T} \cdot {\sum\limits_{t = 1}^{T}\;{{\overset{\_}{y}(t)} \cdot {z\left( {t;{\hat{h}}_{ML}} \right)}^{*}}}}},$  where y(t) denotes a vector of a downconverted and demodulated sample of said received signal, t denotes a time variable, ĥ_(ML) denotes said maximum likelihood estimate, T denotes a sampling duration, (•)* denotes the conjugate of the bracketed expression, and z(t;ĥ_(ML)) denotes a mathematical scalar process involving said a priori probabilities, said variance, said vector and said maximum likelihood estimate.
 7. The channel estimator of claim 6, wherein said channel tap estimator comprises: means for generating a scalar value according to said mathematical scalar process from said a prior probabilities, said variance and said maximum likelihood estimate; means for combining said scalar value with said vector; and means for determining said maximum likelihood estimate from an output of said means for combining.
 8. The channel estimator of claim 7, wherein said means for determining said maximum likelihood estimate comprises a summer over a window of received symbols.
 9. The channel estimator of claim 7, wherein said means for generating said scalar value include means for retrieving said scalar value from a lookup table.
 10. The channel estimator of claim 6, wherein said received signal comprises output of one or more despreaders.
 11. The channel estimator of claim 6, wherein said received signal comprises output of more than one antenna.
 12. A receiver comprising: a first channel estimator to generate an estimate of one or more pilot channel taps of a continuous pilot channel; and a second channel estimator to generate a maximum likelihood estimate of one or more second channel taps of a traffic channel carrying data symbols and interleaved pilot symbols from an equation involving a) said one or more traffic channel taps, b) a priori probabilities of transmitted symbols received over said traffic channel, and c) one or more noise samples, wherein said equation is an implicit equation for said one or more traffic channel taps.
 13. The receiver of claim 12, further comprising: means for combining said estimate of said one or more pilot channel taps and said maximum likelihood estimate.
 14. A method comprising: generating a maximum likelihood estimate of one or more channel taps from an equation involving a) said one or more channel taps, b) a priori probabilities of transmitted symbols in one or more samples of a received signal, wherein the a priori probabilities are based on type of the transmitted symbols, and c) one or more noise samples, wherein said equation is an implicit equation for said one or more channel taps.
 15. The method of claim 14, wherein generating said estimate comprises generating said estimate for a batch of samples at a time.
 16. The method of claim 14, wherein generating said estimate comprises generating said estimate for a single sample at a time.
 17. A method comprising: generating an estimate of one or more pilot channel taps of a continuous pilot channel; and generating a maximum likelihood estimate of one or more second channel taps of a traffic channel carrying data symbols and interleaved pilot symbols from an equation involving a) said one or more traffic channel taps, b) a priori probabilities of transmitted symbols received over said traffic channel, and c) one or more noise samples, wherein said equation is an implicit equation for said one or more traffic channel taps; and combining said estimate of said one or more pilot channel taps and said maximum likelihood estimate.
 18. The receiver of claim 14, wherein the type of the transmitted signals is data symbol type, pilot type or power control type. 